Sustainable distributed permutation flow-shop scheduling model based on a triple bottom line concept
نویسندگان
چکیده
Based on a triple bottom line concept, sustainable development is characterized by the simultaneous pursuit of economic, environmental and social goals. The implementation this concept in production scheduling can result resolution Distributed Permutation Flow Shop Scheduling Problem (DPFSP). present study conceptually shifts an energy-efficient DPFSP to DPFSP, simultaneously contributing improvements. aims not only minimize total energy consumption related production, but also, maximize, for first time, factors linked job opportunities lost working days. Different centers technologies are considered as new suppositions establish DPFSP. In regard, novel multi-objective mixed integer linear model developed. To manage high complexity proposed model, learning-based heuristic established, extension Social Engineering Optimizer (SEO). applicability determined context wood industry Canada. Several simulated tests verify model. compared with one other well-known, recent state-of-the art methods. order guarantee fair comparison, Taguchi method used tune parameters algorithms. Finally, sensitivity analyses done assess efficiency
منابع مشابه
Economic Lot Sizing and Scheduling in Distributed Permutation Flow Shops
This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...
متن کاملTight Bounds for Permutation Flow Shop Scheduling
In flow shop scheduling there are m machines and n jobs, such that every job has to be processed on the machines in the fixed order 1, . . . , m. In the permutation flow shop problem, it is also required that each machine processes the set of all jobs in the same order. Formally, given n jobs along with their processing times on each machine, the goal is to compute a single permutation of the j...
متن کاملTimed Event Graph-based Scheduling for Cyclic Permutation Flow Shop
The cyclic permutation flow shop is one flow shop that repetitively produces product mix under permutation schedules. We propose that the cyclic permutation flow shop given the general job sequence can be modeled as a time event graph, based on which the mixed-integer programming method is applied to find the optimal schedule with maximum throughput. Two cases of cyclic permutation flow shops w...
متن کاملA cloud-based simulated annealing algorithm for order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling
Make-to-order is a production strategy in which manufacturing starts only after a customer's order is received; in other words, it is a pull-type supply chain operation since manufacturing is carried out as soon as the demand is confirmed. This paper studies the order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling with MTO production strategy, the objec...
متن کاملMulti-agent Model Based on Tabu Search for the Permutation Flow Shop Scheduling Problem
In this work, we suggest a Multi-Agent model based on a tabu search method for solving the permutation flow shop scheduling problem. The problem is strongly NP-hard and its resolution optimally within a reasonable time is impossible. The objective of this work is to minimize the makespan or the total duration of the schedule. The proposed model is composed of two classes of agents: Supervisor a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial Information Integration
سال: 2021
ISSN: ['2452-414X', '2467-964X']
DOI: https://doi.org/10.1016/j.jii.2021.100233